//
// Created by ASUS on 2024/3/6.
//
#include <bits/stdc++.h>

using namespace std;

void insertSort(vector<int>&nums){
	int n=nums.size();
	int temp;
	int j;
	for(int i=1;i<=n;i++){
		for(int k=0;k<n;k++){
			cout<<nums[k]<<" ";
		}
		cout<<endl;
		temp=nums[i];
		j=i-1;
		while (nums[j]>temp){
			nums[j+1]=nums[j];
			j=j-1;
		}
		nums[j+1]=temp;
	}
}